Association Matrices and the Kronecker Product of Designs
نویسندگان
چکیده
منابع مشابه
Cayley Transform and the Kronecker Product of Hermitian Matrices
We consider the conditions under which the Cayley transform of the Kronecker product of two Hermitian matrices can be again presented as a Kronecker product of two matrices and, if so, if it is a product of the Cayley transforms of the two Hermitian matrices. 2010 Math. Subj. Class.: 15A69, 15B57.
متن کاملDefect of a Kronecker product of unitary matrices
The generalized defect D(U) of a unitary N ×N matrix U with no zero entries is the dimension of the real space of directions, moving into which from U we do not disturb the moduli |Ui,j | as well as the Gram matrix U∗U in the first order. Then the defect d(U) is equal to D(U) − (2N − 1), that is the generalized defect diminished by the dimension of the manifold {DrUDc : Dr,Dc unitary diagonal}....
متن کاملA constructive arbitrary-degree Kronecker product decomposition of matrices
We propose a constructive algorithm, called the tensor-based Kronecker product (KP) singular value decomposition (TKPSVD), that decomposes an arbitrary real matrix A into a finite sum of KP terms with an arbitrary number of d factors, namely A = ∑R j=1 σj A dj ⊗ · · · ⊗A1j . The algorithm relies on reshaping and permuting the original matrix into a d-way tensor, after which its tensor-train ran...
متن کاملKronecker product approximations for dense block Toeplitz-plus-Hankel matrices
In this paper, we consider the approximation of dense block Toeplitz-plus-Hankel matrices by sums of Kronecker products. We present an algorithm for efficiently computing the matrix approximation that requires the factorization of matrices of much smaller dimension than that of the original. The main results are described for block Toeplitz matrices with Toeplitz-plus-Hankel blocks (BTTHB), but...
متن کاملDesigns in Product Association Schemes
Let (Y; A) be an association scheme with primitive idempotents E 0 ; E 1 ;. .. ; E d. For T f1;. .. ; dg, a Delsarte T-design in (Y; A) is a subset D of Y whose characteristic vector is annihilated by the idempotents E j (j 2 T). The case most studied is that in which (Y; A) is Q-polynomial and T = f1;. .. ; tg. For many such examples, a combina-torial characterization is known, giving an equiv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Mathematical Statistics
سال: 1968
ISSN: 0003-4851
DOI: 10.1214/aoms/1177698427